Runge - Kutta Approximation of Quasi - Linear Parabolic Equations
نویسنده
چکیده
We study the convergence properties of implicit Runge-Kutta methods applied to time discretization of parabolic equations with timeor solutiondependent operator. Error bounds are derived in the energy norm. The convergence analysis uses two different approaches. The first, technically simpler approach relies on energy estimates and requires algebraic stability of the RungeKutta method. The second one is based on estimates for linear time-invariant equations and uses Fourier and perturbation techniques. It applies to A(9)stable Runge-Kutta methods and yields the precise temporal order of convergence. This order is noninteger in general and depends on the type of boundary conditions. Introduction In this paper we investigate the approximation properties of implicit RungeKutta methods applied to time discretization of parabolic equations with timeor solution-dependent operator. Apart from some results in Crouzeix's thesis [3], this appears not to have been studied previously. There are, however, a number of papers dealing with the backward Euler or Crank-Nicolson method, and a few papers studying multistep methods. These papers fall into two groups, depending on whether the results are obtained from1 (A) estimates for linear time-invariant equations coupled with perturbation techniques [3, 18, 21, 26], or (B) energy estimates, e.g. [7, 27] (cf. also [14]). Both approaches turn out to be useful also in the context of Runge-Kutta methods, and to offer different merits. They work with different assumptions about the equation (A: resolvent bounds, B: Gârding's inequality) and require different stability conditions on the part of the methods (A: ^(ö)-stability, B: i?-stability or algebraic stability). When they apply, energy estimates provide far simpler stability and convergence proofs. It seems, however, that they do not yield the noninteger temporal convergence order which is actually observed in computations and can be explained via approach (A). When it comes to modified Runge-Kutta methods, in particular linearly implicit methods [24], there Received by the editor October 7, 1993 and, in revised form, April 8, 1994. 1991 Mathematics Subject Classification. Primary 65M12, 65M15, 65M20, 65J10, 65J15.
منابع مشابه
On Runge-Kutta Methods for Parabolic Problems with Time-Dependent Coefficients
Galerkin fully discrete approximations for parabolic equations with time-dependent coefficients are analyzed. The schemes are based on implicit Runge-Kutta methods, and are coupled with preconditioned iterative methods to approximately solve the resulting systems of linear equations. It is shown that for certain classes of Runge-Kutta methods, the fully discrete equations exhibit parallel featu...
متن کاملRunge-kutta Methods for Parabolic Equations and Convolution Quadrature
We study the approximation properties of Runge-Kutta time discretizations of linear and semilinear parabolic equations, including incompressible Navier-Stokes equations. We derive asymptotically sharp error bounds and relate the temporal order of convergence, which is generally noninteger, to spatial regularity and the type of boundary conditions. The analysis relies on an interpretation of Run...
متن کاملStability of Explicit Runge-Kutta Methods for High Order Finite Element Approximation of Linear Parabolic Equations
We study the stability of explicit Runge-Kutta methods for high order Lagrangian finite element approximation of linear parabolic equations and establish bounds on the largest eigenvalue of the system matrix which determines the largest permissible time step. A bound expressed in terms of the ratio of the diagonal entries of the stiffness and mass matrices is shown to be tight within a small fa...
متن کاملKrylov Subspace Approximation for TEM Simulation in the Time Domain
Forward transient electromagnetic modeling requires the numerical solution of a linear constant-coefficient initial-value problem for the quasi-static Maxwell equations. After discretization in space this problem reduces to a large system of ordinary differential equations, which is typically solved using finite-difference time-stepping. We compare standard time-stepping schemes such as the exp...
متن کاملMultigrid Methods for Implicit Runge-Kutta and Boundary Value Method Discretizations of Parabolic PDEs
Sophisticated high order time discretization methods, such as implicit Runge–Kutta and boundary value methods, are often disregarded when solving time dependent partial differential equations, despite several appealing properties. This is mainly because it is considered hard to develop efficient methods for the more complex linear systems involved. We show here that for implicit Runge–Kutta and...
متن کامل